Largest Placement of One Convex Polygon Inside Another

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Largest Placement of One Convex Polygon Inside Another

We show that the largest similar copy of a convex polygon P with m edges inside a convex polygon Q with n edges can be computed in O mn logn time We also show that the combinatorial complexity of the space of all similar copies of P inside Q is O mn and that it can also be computed in O mn logn time Let P be a convex polygon with m edges and Q a convex polygon with n edges Our goal is to nd the...

متن کامل

Algorithm for finding the largest inscribed rectangle in polygon

In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...

متن کامل

Optimal Polygon Placement

Given a simple polygon P with m vertices and a set S of n points in the plane, we consider the problem of finding a rigid motion placement of P that contains the maximum number of points in S. We present two solutions to this problem that represent time versus space tradeoffs. The first algorithm runs in O(n3m3) expected time using O(n2m2) space. The second algorithm runs in O(n3m3 log(nm)) det...

متن کامل

Convex Polygon Intersection Graphs

Geometric intersection graphs are graphs determined by the intersections of certain geometric objects. We study the complexity of visualizing an arrangement of objects that induces a given intersection graph. We give a general framework for describing classes of geometric intersection graphs, using arbitrary finite base sets of rationally given convex polygons and rationally-constrained affine ...

متن کامل

A note on the size of the largest ball inside a convex polytope

Let m > 1 be an integer, Bm the set of all unit vectors of R pointing in the direction of a nonzero integer vector of the cube [−1, 1]. Denote by sm the radius of the largest ball contained in the convex hull of Bm. We determine the exact value of sm and obtain the asymptotic equality sm ∼ 2 √ log m . Primary subject classification: 52B11 Secondary subject classification: 52B12 §

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete & Computational Geometry

سال: 1998

ISSN: 0179-5376

DOI: 10.1007/pl00009337